Growing networks under geographical constraints
نویسندگان
چکیده
منابع مشابه
Growing random networks under constraints
In recent years measurements on a wide variety of networks such as the world wide web [13,2], the internet backbone [4], social networks [3,24,26] and metabolic networks [14,25] have shown that they differ significantly from the classic Erdos-Renyi model of random graphs [17]. While the traditional Erdos-Renyi model has a Poisson link distribution, with most nodes having a characteristic number...
متن کاملRandom Networks Growing Under a Diameter Constraint
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree distribution then that distribution must be approximately scale-free with an exponent between 2 and 3. The diameter constraint can be interpreted as an environmental ...
متن کاملLearning Bayesian Networks under Equivalence Constraints (Abstract)
Machine learning tasks typically assume that the examples of a given dataset are independent and identically distributed (i.i.d.). Yet, there are many domains and applications where this assumption does not strictly hold. Further, there may be additional information available that ties together the examples of a dataset, which we could exploit to learn more accurate models. For example, there a...
متن کاملCoverage-maximization in networks under resource constraints.
Efficient coverage algorithms are essential for information search or dispersal in all kinds of networks. We define an extended coverage problem which accounts for constrained resources of consumed bandwidth B and time T . Our solution to the network challenge is here studied for regular grids only. Using methods from statistical mechanics, we develop a coverage algorithm with proliferating mes...
متن کاملOptimal redistricting under geographical constraints: Why “pack and crack” does not work.*
We show that even when voters’ preferences are deterministic and known optimal partisan redistricting is not generally obtained by concentrating opponent’s supporters in “unwinnable” districts (“packing”) and spreading one’s own supporters evenly among the other districts in order to produce many slight marginal wins (“cracking”). More generally, we prove that for districting problems with geog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2007
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.75.046117